Product of Polycyclic-by-Finite Groups (PPFG)
نویسندگان
چکیده
منابع مشابه
Algorithms for Polycyclic-by-finite Groups Algorithms for Polycyclic-by-finite Groups Table of Contents
OF THE DISSERTATION Algorithms for Polycyclic-by-Finite Groups by Gretchen Ostheimer Dissertation Director: Professor Charles C. Sims Let R be a number eld. We present several algorithms for working with polycyclicbynite subgroups of GL(n;R). Let G be a subgroup of GL(n;R) given by a nite generating set of matrices. We describe an algorithm for deciding whether or not G is polycyclic-bynite. Fo...
متن کاملAutomorphism groups of polycyclic-by-finite groups and arithmetic groups
We show that the outer automorphism group of a polycyclic-by-finite group is an arithmetic group. This result follows from a detailed structural analysis of the automorphism groups of such groups. We use an extended version of the theory of the algebraic hull functor initiated by Mostow. We thus make applicable refined methods from the theory of algebraic and arithmetic groups. We also construc...
متن کاملAlgorithms for polycyclic-by-finite matrix groups
Let K be a number eld. We present several algorithms for working with polycyclic-by-nite subgroups of GL(n; K). Let G be a subgroup of GL(n; K) given by a nite generatingset of matrices. We describe an algorithm for deciding whether or not G is polycyclic-by-nite. For polycyclic-by-nite G, we describe an algorithm for deciding whether or not a given matrix is an element of G. We also describe a...
متن کاملPrime Ideals in Group Algebras Oe Polycyclic-by-finite Groups
Introduction Group algebras K[G] of poly cyclic-by-finite groups are easily-defined, interesting examples of right and left Noetherian rings. Since prime rings and prime ideals are the basic building blocks in the Goldie theory of Noetherian rings, the determination of the structure of the prime ideals of K[G] is certainly of importance. In a recent fundamental paper [8], Roseblade proved that ...
متن کاملEfficient multiplication algorithms for finite polycyclic groups
Let G be a finite soluble group given by a reduced confluent polycyclic presentation. Represent group elements by reduced words. Then there exists an algorithm for multiplying two group elements which has subexponential running time and requires polynomial space. Moreover, given the prime factorisation of the group order, the problem of multiplying two group elements is probabilistically polyno...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: South Asian Research Journal of Engineering and Technology
سال: 2019
ISSN: 2664-4150,2664-794X
DOI: 10.36346/sarjet.2019.v01i02.003